Murty’s DLP-Based PKCs

-- Sunil Kumar Kashyap, Birendra Kumar Sharma
and Amitabh Banerjee

In 1976, Diffie and Hellman discovered a theory of Public Key Cryptography (PKC) as the application of Discrete Logarithm Problem (DLP). They presented a Key Exchange Protocol (KEP). DLP was first explained by the Prince of Mathematics, Carl Fredrick Johannan Gauss. Taher ElGamal was the first person to design a public key cryptosystem whose security was based on DLP. Basically, this DLP involves a very special type of setting mathematically. DLP is only an element which can be represented in index form. But this element should be a member of an appropriate group. For cryptographic example, DLP is the member of a multiplicative group of the finite field in the basic cryptosystem. Till now, several different group settings have come into existence. Against this backdrop, we propose a new type of DLP, which is found in Cardon and Murty’s research work (Ram Murty, 1998 and 1999), and also PKC based on the proposed DLP.

© 2011 IUP. All Rights Reserved.

Transposition Technique for Cryptography

-- Satish Bansal and Rajesh Shrivastava

Cryptography is the art and science of making secure communication systems. There are many techniques to encrypt plaintext and convert it to ciphertext. We developed a few transposition techniques earlier (Bansal 2011). In this paper, we have made an attempt to enhance those techniques and make them more advanced. One of the most important things is that all the old techniques such as rail fence and simple columns are key-based and the key is in any sequence or in any order to encrypt the plaintext. The best way is that the key depends either on one or two digits which involve with the plaintext. The key can be based on the number of pages, paragraphs or lines so that the sender or receiver can understand and easily decrypt the ciphertext into plaintext. Mainly two techniques are used in classic cryptography: Substitution and Transposition (Menezes et al., 1996). Transposition is simpler and more powerful technique than substitution because it not only substitutes the text, but also permutates the text. This paper basically presents some new transposition techniques that can be used in cryptography (N/W Security). In this paper, we have developed the old transposition algorithm which includes the key based on plaintext.

© 2011 IUP. All Rights Reserved.

Implementation of Automatic Variable Key with Chaos Theory and Studies Thereof

-- B Bhuyan, P Chakrabarti, A Chowdhuri,
F Masulli and C T Bhunia

Automatic Variable Key (AVK) has been studied as a means of time variant key towards achieving perfect security. This paper investigates the implementation of AVK with chaos theory with the existing cryptographic algorithms where it is not necessary to exchange the session key in sessions other than the first session. The initial key is generated using the concept of chaos theory and the key so generated is exchanged between the sender and the receiver by public key. Thereafter, the key of each of other sessions is made to change as a function of data of plaintext as in normal AVK. An experiment was performed to study the differential attack in normal cipher, cipher with normal AVK and cipher with AVK with chaos theory. The findings revealed that the differential attack was minimum in the case of cipher with AVK with chaos theory. The reduction of differential attack was due to the application of chaos theory in the initial key generation.

© 2011 IUP. All Rights Reserved.

New Backfilling Algorithm for Multiprocessor Scheduling with Gang Scheduling

-- R Siyambalapitiya and M Sandirigama

In this study, we propose an efficient algorithm for the multiprocessor job scheduling problem. From a given list of jobs, jobs are queued according to the decreasing order of their durations. Depending upon the job duration, jobs are divided into multiple threads for processing. Multithread jobs are processed based on the concept of ‘gang scheduling’. To minimize the idle time of the processors, backfilling approach is incorporated into the algorithm.

© 2011 IUP. All Rights Reserved.

RDF-Based E-Commerce Web Application

-- B Vijaya Lakshmi, D V N Harish and Ch Srikanth Varma

E-commerce-based web applications are designed to facilitate data interchange and data exchange collaboration. Meaningful and useful information is extracted in order to process and integrate the web-based information. In this paper, we show how ontological information improves the search process with a high degree of autonomy to the web services, thus benefitting the customers.

© 2011 IUP. All Rights Reserved.

Service Reusability with Educational Information System

-- Atanu Rakshit and R Kamatchi

The Service-Oriented Architecture (SOA) is an evolving technology which can be fitted between the distributed computing and today’s grid and cloud computing technology which provides higher reusability in the educational sector. This paper makes an attempt to provide an experimental base for proving the reusability factor in the above-mentioned area. The paper also focuses on describing and experimenting with various reusability parameters in the Educational Information System (EIS) model.

© 2011 IUP. All Rights Reserved.